Symbol Spotting using Full Visibility Graph Representation
نویسندگان
چکیده
In this paper, a method for matching symbols in line-drawings is presented. Facing both segmentation and recognition of symbols is a difficult challenge. Starting from the results of a vectorization procedure, a visibility graph is built to enhance the main geometric constraints which were specified during the construction of the initial document. The cliques detection, which correspond to a perceptual grouping of primitives, is used in the system to detect regions of particular interest. Both opened and perceptually closed curves are identified from aggregation of cliques. Finally, the recognition stage uses an attributed edit distance technique to match approximated curves within the host attributed relation graph and the ones from a collection of symbols.
منابع مشابه
Symbol Spotting in Graphical Documents Using Graph Representations
Many methods of graphics recognition have been developed throughout the years for the recognition of pre-segmented graphics symbols but very few techniques achieved the objective of symbol spotting and recognition together in a generic case. To go one step forward through this objective, this paper presents an original solution for symbol spotting using a graph representation of graphical docum...
متن کاملSpotting Symbols in Line Drawing Images Using Graph Representations
Many methods of graphics recognition have been developed throughout the years for the recognition of pre-segmented graphics symbols but very few techniques achieved the objective of symbol spotting and recognition together in a generic case. To go one step forward through this objective, this paper presents an original solution for symbol spotting using a graph representation of graphical docum...
متن کاملBag-of-GraphPaths for Symbol Recognition and Spotting in Line Drawings
Graphical symbol recognition and spotting recently have become an important research activity. In this work we present a descriptor for symbols, especially for line drawings. The descriptor is based on the graph representation of graphical objects. We construct graphs from the vectorized information of the binarized images, where the critical points detected by the vectorization algorithm are c...
متن کاملA Product Graph Based Method for Dual Subgraph Matching Applied to Symbol Spotting
Product graph has been shown as a way for matching subgraphs. This paper reports the extension of the product graph methodology for subgraph matching applied to symbol spotting in graphical documents. Here we focus on the two major limitations of the previous version of the algorithm: (1) spurious nodes and edges in the graph representation and (2) inefficient node and edge attributes. To deal ...
متن کاملA Bag-of-Paths Based Serialized Subgraph Matching for Symbol Spotting in Line Drawings
In this paper we propose an error tolerant subgraph matching algorithm based on bag-of-paths for solving the problem of symbol spotting in line drawings. Bag-of-paths is a factorized representation of graphs where the factorization is done by considering all the acyclic paths between each pair of connected nodes. Similar paths within the whole collection of documents are clustered and organized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007